Average Performance of Passive Algorithms for Global Optimization
نویسندگان
چکیده
منابع مشابه
Average Performance of a Class of Adaptive Algorithms for Global Optimization
We describe a class of adaptive algorithms for approximating the global minimum of a continuous function on the unit interval. The limiting distribution of the error is derived under the assumption of Wiener measure on the objective functions. For any > 0, we construct an algorithm which has error converging to zero at rate n ?(1?) in the number of function evaluations n. This convergence rate ...
متن کاملPerformance Comparison of Electromagnetism-Like Algorithms for Global Optimization
Electromagnetism-like (EML) algorithm is a new evolutionary algorithm that bases on the electromagnetic attraction and repulsion among particles. It was originally proposed to solve optimization problems with bounded variables. Since its inception, many variants of the EML algorithm have been proposed in the literature. However, it remains unclear how to simulate the electromagnetic heuristics ...
متن کاملPerformance Profile Assessment of Electromagnetism-like Algorithms for Global Optimization
This paper introduces a modification on the movement force vector of the Birbil and Fang’s electromagnetism-like algorithm [1] for solving global optimization problems with bounded variables. The proposed movement vector combines the total force exerted on each point of the population, at the current iteration, with the rate of change in the force vector of a previous iteration. Several widely ...
متن کاملGlobal Optimization Performance Measures for Generalized Hill Climbing Algorithms
Generalized hill climbing algorithms provide a framework for modeling several local search algorithms for hard discrete optimization problems. This paper introduces and analyzes generalized hill climbing algorithm performance measures that reflect how effectively an algorithm has performed to date in visiting a global optimum and how effectively an algorithm may perform in the future in visitin...
متن کاملPERFORMANCE OF DIFFERENT ANT-BASED ALGORITHMS FOR OPTIMIZATION OF MIXED VARIABLE DOMAIN IN CIVIL ENGINEERING DESIGNS
Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1995
ISSN: 0022-247X
DOI: 10.1006/jmaa.1995.1151